Normal forms for binary relations
نویسندگان
چکیده
منابع مشابه
Normal forms for binary relations
We consider the representable equational theory of binary relations, in a language expressing composition, converse, and lattice operations. By working directly with a presentation of relation expressions as graphs we are able to define a notion of reduction which is confluent and strongly normalizing and induces a notion of computable normal form for terms. This notion of reduction thus leads ...
متن کاملNormal Forms and Reduction for Theories of Binary Relations
We consider equational theories of binary relations, in a language expressing composition, converse, and lattice operations. We treat the equations valid in the standard model of sets and also define a hierarchy of equational axiomatisations stratifying the standard theory. By working directly with a presentation of relation-expressions as graphs we are able to define a notion of reduction whic...
متن کاملNormal Forms for Partitions and Relations
Recently there has been a growing interest towards algebraic structures that are able to express formalisms diierent from the standard , tree-like presentation of terms. Many of these approaches reveal a speciic interest towards their application in the \distributed and concurrent systems" eld, but an exhaustive comparison between them is diicult because their presentations can be quite dissimi...
متن کاملEquivalence relations, invariants, and normal forms
For an equivalence relation E on the words in some finite alphabet, we consider the recognition problem (decide whether two words are equivalent), the invariant problem (calculate a function constant on precisely the equivalence classes), the normal form problem (calculate a particular member of an equivalence class, given an arbitrary member) and the first member problem (calculate the first m...
متن کاملNormal Forms for Characteristic Functions on -ary Relations
Functions of type are characteristic functions on -ary relations. Keenan established their importance for natural language semantics, by showing that natural language has many examples of irreducible type functions, i.e. functions of type that cannot be represented as compositions of unary functions. Keenan proposed some tests for reducibility, and Dekker improved on these by proposing an invar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.03.023